Earliest Due Date First Matching for Input-queued Cell Switches

The input-queued switching architecture is becoming an attractive alternative for high speed switches owing to its scalability. Tremendous eeorts have been made to overcome the throughput problem caused by the contentions occurred at input and output sides of a switch. Existing input queueing algorithms mostly aim at improving through-put without considering QoS features. In this paper, a new algorithm, referred to as earliest due date rst matching (EDDFM), is introduced to improve upon existing algorithms in term of probability of cell delay overdue. It is shown both analytically and by simulations that EDDFM is stable and non-starving. Simulations also demonstrate that it has lower cell delay overdue probability than previously proposed algorithms.